Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n
نویسندگان
چکیده
In this paper, we show that if a partially ordered set has 2n elements and has dimension n, then it is isosnorphic to the set of n-l element subsets and lelement subsets of a sef, ordered by inclusion, or else it has six elements and is isomorphic to a partially ordered b;i we call the chevron or to its dual.
منابع مشابه
Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension
Dushnik and Mikr detirw tht: dimension of a partially crderc-d set X, denoted dim X, as the smallest positive integLi f for whkh thckre exist t linear estcnsions of X whose inter-saztion is the partial ordertng OF A'. Hiraguchi proved that ifr-t 2 2 and 1x1 G 2rt + 1, then dim X Q. n. dogart, Trotter and Kim& have gsven a forbidden c-• bposet characteriza?ion of Htraguchi " s Inequality by dete...
متن کاملApplications of the Probabilistic Method to Partially Ordered Sets
There are two central themes to research involving applications of probabilistic methods to partially ordered sets. The first of these can be described as the study of random partially ordered sets. Among the specific models which have been studied are: random labelled posets; random t-dimensional posets; and the transitive closure of random graphs. A second theme concentrates on the adaptation...
متن کاملRectangles are Better than Chains for Encoding Partially Ordered Sets
Partial orders have applications in various areas in computer science such as distributed systems, object oriented languages, knowledge representation systems and databases. In this paper we present a new technique to encode partially ordered sets or posets. Specifically, we use the family of two-dimensional posets, which we refer to as rectangles, to encode a given poset; an element x is less ...
متن کاملDegrees of Freedom Versus Dimension for Containment Orders
Given a family of sets S, where the sets in S admit k ‘degrees of freedom’, we prove that not all (k + 1)-dimensional posets are containment posets of sets in S. Our results depend on the following enumerative result of independent interest: Let P (n, k) denote the number of partially ordered sets on n labeled elements of dimension k. We show that logP (n, k) ∼ nk log n where k is fixed and n i...
متن کاملCharacterization problems for graphs, partially ordered sets, lattices, and families of sets
A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization problems for interval graphs, circular arc graphs, comparability graphs, planar lattices, 0--1 mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 1973